Constraint Directed Variable Neighbourhood Search
نویسندگان
چکیده
Local search algorithms operate by making small changes to candidate solutions with the aim of reaching new and improved solutions. The problem is that often the search will become trapped at sub optimal states from where there are no improving neighbours. Much research has gone into creating schemes to avoid these local optima and various strategies exist mainly based around altering the acceptance function. Another approach is Variable Neighbourhood Search which aims to bypass optima by linearly switching through multiple search neighbourhoods. We propose a new method where the selection of neighbourhoods is dynamically decided dependant on the violations of the problem constraints, Constraint Directed Variable Neighbourhood Search. We compared Constraint Directed Variable Neighbourhood Search to Variable Neighbourhood Search and show that the same search progress can be achieved whilst exploring only a fraction of the states.
منابع مشابه
A Simulated Annealing Algorithm within the Variable Neighbourhood Search Framework to Solve the Capacitated Facility Location-Allocation Problem
In this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. In this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. To tackle the problem efficiently and effectively, an effici...
متن کاملRevisiting constraint-directed search
We revisit the exploration of constraint-directed neighbourhoods, where a (small) set of constraints is picked before considering the neighbouring configurations where those constraints have a decreased (or preserved, or increased) penalty. Given the semantics of a constraint, such neighbourhoods can be represented via new attributes or primitives for the corresponding constraint object. We sho...
متن کاملA Constraint-directed Local Search Approach to Nurse Rostering Problems
In this paper, we investigate the hybridization of constraint programming and local search techniques within a large neighbourhood search scheme for solving highly constrained nurse rostering problems. As identified by the research, a crucial part of the large neighbourhood search is the selection of the fragment (neighbourhood, i.e. the set of variables), to be relaxed and re-optimized iterati...
متن کاملAn efficient hybrid iterated local search algorithm for the total tardiness blocking flow shop problem
This paper deals with the blocking flow shop problem and proposes an Iterated Local Search (ILS) procedure combined with a variable neighbourhood search (VNS) for the total tardiness minimization. The proposed ILS makes use of a NEH-based procedure to generate the initial solution, uses a local search to intensify the exploration which combines the insertion and swap neighbourhood and uses a pe...
متن کاملA variable neighbourhood search algorithm for the constrained task allocation problem
A Variable Neighbourhood Search algorithm that employs new neighbourhoods is proposed for solving a task allocation problem whose main characteristics are: (i) each task requires a certain amount of resources and each processor has a capacity constraint which limits the total resource of the tasks that are assigned to it; (ii) the cost of solution includes fixed costs when using processors, tas...
متن کامل